Inverting the Furstenberg correspondence

نویسندگان

  • Jeremy Avigad
  • JEREMY AVIGAD
چکیده

Given a sequence of sets An ⊆ {0, . . . , n − 1}, the Furstenberg correspondence principle provides a shift-invariant measure on 2 that encodes combinatorial information about infinitely many of the An’s. Here it is shown that this process can be inverted, so that for any such measure, ergodic or not, there are finite sets whose combinatorial properties approximate it arbitarily well. The finite approximations are obtained from the measure by an explicit construction, with an explicit upper bound on how large n has to be to yield a sufficiently good approximation. We draw conclusions for computable measure theory, and show, in particular, that given any computable shift-invariant measure on 2, there is a computable element of 2 that is generic for the measure. We also consider a generalization of the correspondence principle to countable discrete amenable groups, and once again provide an effective inverse.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deducing the Multidimensional Szemerédi Theorem from the Infinitary Hypergraph Removal Lemma

We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T1, T2, . . . , Td : Z y (X,Σ, μ) ([5]), and so, via the Furstenberg correspondence principle introduced in [4], a new proof of the multi-dimensional Szemerédi Theorem. We bypass the detailed analysis of certain towers of factors of a probability-preserving...

متن کامل

A General Correspondence between Averages and Integrals

Recent work has generalized the Furstenberg correspondence between sets of integers and dynamical systems to versions which involve sequences of finite graphs or sequences of L∞ functions. We give a unified version of the theorem subsuming all these generalizations.

متن کامل

Deducing the Multidimensional Szemerédi Theorem from an Infinitary Removal Lemma

We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T1, T2, . . . , Td : Z y (X,Σ, μ) ([6]), and so, via the Furstenberg correspondence principle introduced in [5], a new proof of the multi-dimensional Szemerédi Theorem. We bypass the careful manipulation of certain towers of factors of a probability-preserv...

متن کامل

Single DV-DXCCII Based Voltage Controlled First Order All-pass Filter with Inverting and Non-inverting responses

In this paper, a new voltage controlled first order all-pass filter is presented. The proposed circuit employs a single differential voltage dual-X second generation current conveyor (DV-DXCCII) and a grounded capacitor only. The proposed all-pass filter provides both inverting and non inverting voltage-mode outputs from the same configuration simultaneously without any matching condition. Non-...

متن کامل

A Correspondence Principle between (hyper)graph Theory and Probability Theory, and the (hyper)graph Removal Lemma

We introduce a correspondence principle (analogous to the Furstenberg correspondence principle) that allows one to extract an infinite random graph or hypergraph from a sequence of increasingly large deterministic graphs or hypergraphs. As an application we present a new (infinitary) proof of the hypergraph removal lemma of Nagle-Schacht-Rödl-Skokan and Gowers, which does not require the hyperg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016